Revisiting the calculation of effective free distance of turbo codes
نویسنده
چکیده
Introduction: Several authors [1, 2] have agreed that the performance of turbo codes [3] at the error floor region is largely determined by the weight-2 input minimum distance, which corresponds to the minimum Hamming weight among all codeword sequences generated by input sequences of weight two. If a turbo code T consists of N parallel concatenated convolutional codes separated by uniform interleavers, its weight-2 input minimum distance d2 T, which is also referred to as the effective free distance of T, can be written as [4, 5]
منابع مشابه
Revisiting the Calculation of the Effective Free Distance of Turbo Codes
Introduction: Several authors [1, 2] have agreed that the performance of turbo codes [3] at the error floor region is largely determined by the weight-2 input minimum distance, which corresponds to the minimum Hamming weight among all codeword sequences generated by input sequences of weight two. If a turbo code T consists of N parallel concatenated convolutional codes separated by uniform inte...
متن کاملAn approach to fault detection and correction in design of systems using of Turbo codes
We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...
متن کاملImproving the Constituent Codes of Turbo Encoders
The performance of Turbo codes can be improved by choosing the best constituent encoder. Previous lists of the best constituent codes were found based on maximising the input weight two effective free distance d 2. We show that minimis-ing the number of nearest neighbours N 2 is also an important requirement. If there are multiple codes having the same d 2 and N 2 , we show that the minimum dis...
متن کاملAn Algorithm to Compute the Free Distance of Turbo Codes
A new algori thm for computing the free distance of turbo codes is applied to the CCSDS and the UMTS standard codes. Results on the free distance behaviour for increasing interleaver length are also presented.
متن کاملOn the Design of Turbo Codes
In this article, we design new turbo codes that can achieve near-Shannon-limit performance. The design criterion for random interleavers is based on maximizing the effective free distance of the turbo code, i.e., the minimum output weight of codewords due to weight-2 input sequences. An upper bound on the effective free distance of a turbo code is derived. This upper bound can be achieved if th...
متن کامل